A new family of random graphs for testing spatial segregation

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A new family of random graphs for testing spatial segregation

We discuss a graph-based approach for testing spatial point patterns. This approach falls under the category of data-random graphs, which have been introduced and used for statistical pattern recognition in recent years. Our goal is to test complete spatial randomness against segregation and association between two or more classes of points. To attain this goal, we use a particular type of para...

متن کامل

Spatial Segregation in Demography: A Short Review

  Abstract. Spatial has always been an inherent component of demography, and demographic processes are inherently spatiotemporal. Recognizing the importance of spatial in general and spatial segregation in particular in demographic analysis has created new positions in demography and its conceptual and analytical frameworks. The notion of spatial segregation refers to the distribution of social...

متن کامل

The Use of Domination Number of a Random Proximity Catch Digraph for Testing Spatial Patterns of Segregation and Association

Priebe et al. (2001) introduced the class cover catch digraphs and computed the distribution of the domination number of such digraphs for one dimensional data. In higher dimensions these calculations are extremely difficult due to the geometry of the proximity regions; and only upper-bounds are available. In this article, we introduce a new type of data-random proximity map and the associated ...

متن کامل

Testing Centrality in Random Graphs

When testing centrality in random graphs it is of importance to specify models that capture the irregularities in the structure due to centrality. In this paper we propose using the well-known block models in an attempt to capture such irregularities. The baseline model, revealing no centrality structure, used in this paper is the Bernoulli model. It is shown that the maximum likelihood estimat...

متن کامل

Dependent random graphs and spatial

We extend certain exponential decay results of subcritical percolation to a class of locally dependent random graphs, introduced by Kuulasmaa as models for spatial epidemics on Z d. In these models, infected individuals eventually die (are removed) and are not replaced. We combine these results with certain continuity and re-scaling arguments in order to improve our knowledge of the phase diagr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Canadian Journal of Statistics

سال: 2007

ISSN: 0319-5724,1708-945X

DOI: 10.1002/cjs.5550350106